<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Library Evolutionary Algorithms for Clustering (LEAC): include/clustering_operator_medoids.hpp Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td id="projectlogo"><img alt="Logo" src="leac_logo.png"/></td>
  <td id="projectalign" style="padding-left: 0.5em;">
   <div id="projectname">Library Evolutionary Algorithms for Clustering (LEAC)
   &#160;<span id="projectnumber">Version 1.0</span>
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
<script type="text/javascript" src="menudata.js"></script>
<script type="text/javascript" src="menu.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&amp;dn=gpl-2.0.txt GPL-v2 */
$(function() {
  initMenu('',false,false,'search.php','Search');
});
/* @license-end */</script>
<div id="main-nav"></div>
<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_d44c64559bbebec7f509842c48db8b23.html">include</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle">
<div class="title">clustering_operator_medoids.hpp</div>  </div>
</div><!--header-->
<div class="contents">
<a href="clustering__operator__medoids_8hpp.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;</div><div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="preprocessor">#ifndef __CLUSTERING_OPERATOR_MEDOIDS_HPP__</span></div><div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="preprocessor">#define __CLUSTERING_OPERATOR_MEDOIDS_HPP__</span></div><div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;</div><div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="preprocessor">#include &lt;utility&gt;</span>      <span class="comment">// std::pair</span></div><div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="dist__matrix__dissimilarity_8hpp.html">dist_matrix_dissimilarity.hpp</a>&quot;</span></div><div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="instance_8hpp.html">instance.hpp</a>&quot;</span></div><div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="partition__linked_8hpp.html">partition_linked.hpp</a>&quot;</span></div><div class="line"><a name="l00019"></a><span class="lineno">   19</span>&#160;</div><div class="line"><a name="l00020"></a><span class="lineno">   20</span>&#160;</div><div class="line"><a name="l00021"></a><span class="lineno">   21</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="verbose__global_8hpp.html">verbose_global.hpp</a>&quot;</span></div><div class="line"><a name="l00022"></a><span class="lineno">   22</span>&#160;</div><div class="line"><a name="l00031"></a><span class="lineno">   31</span>&#160;<span class="keyword">namespace </span><a class="code" href="namespaceclusteringop.html">clusteringop</a> {</div><div class="line"><a name="l00032"></a><span class="lineno">   32</span>&#160;  </div><div class="line"><a name="l00033"></a><span class="lineno">   33</span>&#160;</div><div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;<span class="keyword">template</span> &lt; <span class="keyword">typename</span> T_INSTANCEIDX,</div><div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;           <span class="keyword">typename</span> T_DIST,</div><div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;           <span class="keyword">typename</span> T_CLUSTERIDX    <span class="comment">//-1, 0, 1, .., K</span></div><div class="line"><a name="l00044"></a><span class="lineno">   44</span>&#160;           &gt;</div><div class="line"><a name="l00045"></a><span class="lineno">   45</span>&#160;std::tuple&lt; T_DIST, ds::PartitionLinked&lt;T_CLUSTERIDX&gt; &gt;</div><div class="line"><a name="l00046"></a><span class="lineno">   46</span>&#160;<a class="code" href="namespaceclusteringop.html#a9811c142c169af0321631f773797089c">nearestRepresentative</a></div><div class="line"><a name="l00047"></a><span class="lineno"><a class="line" href="namespaceclusteringop.html#a9811c142c169af0321631f773797089c">   47</a></span>&#160;(T_INSTANCEIDX                   *aioarrayui_idxMedoids,</div><div class="line"><a name="l00048"></a><span class="lineno">   48</span>&#160; T_CLUSTERIDX                    aicidx_numKMedoids,</div><div class="line"><a name="l00049"></a><span class="lineno">   49</span>&#160; <span class="keyword">const</span> <a class="code" href="classmat_1_1_matrix_triang.html">mat::MatrixTriang&lt;T_DIST&gt;</a> &amp;aimattriag_dissimilarity</div><div class="line"><a name="l00050"></a><span class="lineno">   50</span>&#160; ) </div><div class="line"><a name="l00051"></a><span class="lineno">   51</span>&#160;{ </div><div class="line"><a name="l00052"></a><span class="lineno">   52</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00053"></a><span class="lineno">   53</span>&#160;  <span class="keyword">const</span> <span class="keywordtype">char</span>* lpc_label = <span class="stringliteral">&quot;clusteringop::nearestRepresentative:&quot;</span>;</div><div class="line"><a name="l00054"></a><span class="lineno">   54</span>&#160;  ++geiinparam_verbose;</div><div class="line"><a name="l00055"></a><span class="lineno">   55</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00056"></a><span class="lineno">   56</span>&#160;    std::cout &lt;&lt; lpc_label</div><div class="line"><a name="l00057"></a><span class="lineno">   57</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;  IN(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="stringliteral">&quot;)\n&quot;</span></div><div class="line"><a name="l00058"></a><span class="lineno">   58</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\t input T_INSTANCES_IDX: *aioarrayui_idxMedoids [&quot;</span></div><div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;              &lt;&lt; aioarrayui_idxMedoids &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span></div><div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\t input mat::MatrixTriang: aimattriag_dissimilarity[&quot;</span>  </div><div class="line"><a name="l00061"></a><span class="lineno">   61</span>&#160;              &lt;&lt;  &amp;aimattriag_dissimilarity &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span></div><div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\t)&quot;</span></div><div class="line"><a name="l00063"></a><span class="lineno">   63</span>&#160;              &lt;&lt; std::endl;</div><div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;  }</div><div class="line"><a name="l00065"></a><span class="lineno">   65</span>&#160;<span class="preprocessor">#endif //__VERBOSE_YES </span></div><div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;</div><div class="line"><a name="l00067"></a><span class="lineno">   67</span>&#160;  T_DIST               lor_cost = T_DIST(0);</div><div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;  <span class="keyword">const</span> T_INSTANCEIDX  lui_numInstances = T_INSTANCEIDX(aimattriag_dissimilarity.<a class="code" href="classmat_1_1_matrix_triang.html#ae8e385b7959c85519692bdee1d4c3aed">getNumRows</a>());</div><div class="line"><a name="l00069"></a><span class="lineno">   69</span>&#160;  <span class="comment">//Initialize PartitionLink</span></div><div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;  <a class="code" href="classds_1_1_partition_linked.html">ds::PartitionLinked&lt;T_CLUSTERIDX&gt;</a></div><div class="line"><a name="l00071"></a><span class="lineno">   71</span>&#160;    lopartlink_partition</div><div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;     (lui_numInstances, </div><div class="line"><a name="l00073"></a><span class="lineno">   73</span>&#160;     (T_INSTANCEIDX) aicidx_numKMedoids</div><div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;     );</div><div class="line"><a name="l00075"></a><span class="lineno">   75</span>&#160;  </div><div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;  T_DIST  lrt_distMinMedoidsInst;</div><div class="line"><a name="l00077"></a><span class="lineno">   77</span>&#160;  </div><div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;  <span class="keywordflow">for</span> (T_INSTANCEIDX luintidx_i = 0; luintidx_i &lt; lui_numInstances; luintidx_i++) {</div><div class="line"><a name="l00079"></a><span class="lineno">   79</span>&#160;    <span class="comment">//Find medoids nearest</span></div><div class="line"><a name="l00080"></a><span class="lineno">   80</span>&#160;    T_CLUSTERIDX lcidx_mj = </div><div class="line"><a name="l00081"></a><span class="lineno">   81</span>&#160;      <a class="code" href="namespacenearest.html#a3c4239101cf18ab4ca62e654a4179995">nearest::medoidsNN</a></div><div class="line"><a name="l00082"></a><span class="lineno">   82</span>&#160;      &lt;T_CLUSTERIDX,T_DIST&gt;</div><div class="line"><a name="l00083"></a><span class="lineno">   83</span>&#160;      (lrt_distMinMedoidsInst,</div><div class="line"><a name="l00084"></a><span class="lineno">   84</span>&#160;       luintidx_i,</div><div class="line"><a name="l00085"></a><span class="lineno">   85</span>&#160;       aioarrayui_idxMedoids,</div><div class="line"><a name="l00086"></a><span class="lineno">   86</span>&#160;       aicidx_numKMedoids,</div><div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;       aimattriag_dissimilarity</div><div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;       );</div><div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;</div><div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;    lopartlink_partition.addInstanceToCluster(lcidx_mj,luintidx_i);</div><div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;  </div><div class="line"><a name="l00092"></a><span class="lineno">   92</span>&#160;    lor_cost += (T_DIST) lrt_distMinMedoidsInst;</div><div class="line"><a name="l00093"></a><span class="lineno">   93</span>&#160;  }</div><div class="line"><a name="l00094"></a><span class="lineno">   94</span>&#160;  </div><div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00097"></a><span class="lineno">   97</span>&#160;     std::cout &lt;&lt; lpc_label</div><div class="line"><a name="l00098"></a><span class="lineno">   98</span>&#160;              &lt;&lt; <span class="stringliteral">&quot; OUT(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="stringliteral">&quot;)\n&quot;</span></div><div class="line"><a name="l00099"></a><span class="lineno">   99</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;output PartitionLinked: [&quot;</span> &lt;&lt; &amp;lopartlink_partition &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span>;</div><div class="line"><a name="l00100"></a><span class="lineno">  100</span>&#160;    lopartlink_partition.print</div><div class="line"><a name="l00101"></a><span class="lineno">  101</span>&#160;      (std::cout,</div><div class="line"><a name="l00102"></a><span class="lineno">  102</span>&#160;       lpc_label</div><div class="line"><a name="l00103"></a><span class="lineno">  103</span>&#160;       );</div><div class="line"><a name="l00104"></a><span class="lineno">  104</span>&#160;    std::cout  &lt;&lt; <span class="stringliteral">&quot;\noutput lor_cost: &quot;</span> &lt;&lt; lor_cost </div><div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;               &lt;&lt; std::endl;</div><div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;  }</div><div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;  --geiinparam_verbose;</div><div class="line"><a name="l00108"></a><span class="lineno">  108</span>&#160;<span class="preprocessor">#endif //__VERBOSE_YES</span></div><div class="line"><a name="l00109"></a><span class="lineno">  109</span>&#160;</div><div class="line"><a name="l00110"></a><span class="lineno">  110</span>&#160;  <span class="keywordflow">return</span> std::make_tuple</div><div class="line"><a name="l00111"></a><span class="lineno">  111</span>&#160;    (  lor_cost</div><div class="line"><a name="l00112"></a><span class="lineno">  112</span>&#160;     , lopartlink_partition </div><div class="line"><a name="l00113"></a><span class="lineno">  113</span>&#160;     );</div><div class="line"><a name="l00114"></a><span class="lineno">  114</span>&#160;  </div><div class="line"><a name="l00115"></a><span class="lineno">  115</span>&#160;}</div><div class="line"><a name="l00116"></a><span class="lineno">  116</span>&#160;</div><div class="line"><a name="l00125"></a><span class="lineno">  125</span>&#160;<span class="keyword">template</span> &lt; <span class="keyword">typename</span> T_INSTANCEIDX,</div><div class="line"><a name="l00126"></a><span class="lineno">  126</span>&#160;           <span class="keyword">typename</span> T_DIST,</div><div class="line"><a name="l00127"></a><span class="lineno">  127</span>&#160;           <span class="keyword">typename</span> T_CLUSTERIDX    <span class="comment">//-1, 0, 1, .., K</span></div><div class="line"><a name="l00128"></a><span class="lineno">  128</span>&#160;           &gt;</div><div class="line"><a name="l00129"></a><span class="lineno">  129</span>&#160;std::pair&lt;T_DIST,T_INSTANCEIDX&gt;</div><div class="line"><a name="l00130"></a><span class="lineno">  130</span>&#160;<a class="code" href="namespaceclusteringop.html#a9811c142c169af0321631f773797089c">nearestRepresentative</a></div><div class="line"><a name="l00131"></a><span class="lineno"><a class="line" href="namespaceclusteringop.html#a53d2b1e72d462871d3fdfb52f3ece4a4">  131</a></span>&#160;(T_CLUSTERIDX                     *aoarraycidx_memberShip,</div><div class="line"><a name="l00132"></a><span class="lineno">  132</span>&#160; <span class="keyword">const</span> T_INSTANCEIDX              *aioarrayui_idxMedoids,</div><div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160; <span class="keyword">const</span> T_CLUSTERIDX               aicidx_numKMedoids,</div><div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160; <span class="keyword">const</span> <a class="code" href="classmat_1_1_matrix_triang.html">mat::MatrixTriang&lt;T_DIST&gt;</a>  &amp;aimattriag_dissimilarity</div><div class="line"><a name="l00135"></a><span class="lineno">  135</span>&#160; ) </div><div class="line"><a name="l00136"></a><span class="lineno">  136</span>&#160;{</div><div class="line"><a name="l00137"></a><span class="lineno">  137</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00138"></a><span class="lineno">  138</span>&#160;  <span class="keyword">const</span> <span class="keywordtype">char</span>* lpc_labelFunc = <span class="stringliteral">&quot;clusteringop::nearestRepresentative&quot;</span>;</div><div class="line"><a name="l00139"></a><span class="lineno">  139</span>&#160;  ++geiinparam_verbose;</div><div class="line"><a name="l00140"></a><span class="lineno">  140</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00141"></a><span class="lineno">  141</span>&#160;    std::cout &lt;&lt; lpc_labelFunc </div><div class="line"><a name="l00142"></a><span class="lineno">  142</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;:  IN(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="stringliteral">&quot;)\n&quot;</span></div><div class="line"><a name="l00143"></a><span class="lineno">  143</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\t(output T_CLUSTERIDX*: aoarraycidx_memberShip[&quot;</span> </div><div class="line"><a name="l00144"></a><span class="lineno">  144</span>&#160;              &lt;&lt; aoarraycidx_memberShip &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span></div><div class="line"><a name="l00145"></a><span class="lineno">  145</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\t  input T_INSTANCEIDX* aioarrayui_idxMedoids[&quot;</span> </div><div class="line"><a name="l00146"></a><span class="lineno">  146</span>&#160;              &lt;&lt;  aioarrayui_idxMedoids &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span></div><div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\t  input T_CLUSTERIDX: aicidx_numKMedoids = &quot;</span></div><div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;              &lt;&lt; aicidx_numKMedoids &lt;&lt; <span class="charliteral">&#39;\n&#39;</span></div><div class="line"><a name="l00149"></a><span class="lineno">  149</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\t  input  mat::MatrixTriang: aimattriag_dissimilarity[&quot;</span>  </div><div class="line"><a name="l00150"></a><span class="lineno">  150</span>&#160;              &lt;&lt;  &amp;aimattriag_dissimilarity &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span></div><div class="line"><a name="l00151"></a><span class="lineno">  151</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\t)\n&quot;</span>;</div><div class="line"><a name="l00152"></a><span class="lineno">  152</span>&#160;  }</div><div class="line"><a name="l00153"></a><span class="lineno">  153</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES */</span><span class="preprocessor"></span></div><div class="line"><a name="l00154"></a><span class="lineno">  154</span>&#160;</div><div class="line"><a name="l00155"></a><span class="lineno">  155</span>&#160;  T_DIST              lor_cost = T_DIST(0);</div><div class="line"><a name="l00156"></a><span class="lineno">  156</span>&#160;  T_INSTANCEIDX       louintidx_threshold = 0;  </div><div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;  T_DIST              lrt_distMinMedoidsInst;</div><div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;  <span class="keyword">const</span> T_INSTANCEIDX lui_numInstances = </div><div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;    T_INSTANCEIDX(aimattriag_dissimilarity.<a class="code" href="classmat_1_1_matrix_triang.html#ae8e385b7959c85519692bdee1d4c3aed">getNumRows</a>());</div><div class="line"><a name="l00160"></a><span class="lineno">  160</span>&#160;</div><div class="line"><a name="l00161"></a><span class="lineno">  161</span>&#160;  <span class="keywordflow">for</span> (T_INSTANCEIDX lui = 0; lui &lt; lui_numInstances; lui++) {</div><div class="line"><a name="l00162"></a><span class="lineno">  162</span>&#160;    <span class="comment">/* Find medoids nearest */</span></div><div class="line"><a name="l00163"></a><span class="lineno">  163</span>&#160;    T_CLUSTERIDX lcidx_mj = </div><div class="line"><a name="l00164"></a><span class="lineno">  164</span>&#160;      <a class="code" href="namespacenearest.html#a3c4239101cf18ab4ca62e654a4179995">nearest::medoidsNN</a></div><div class="line"><a name="l00165"></a><span class="lineno">  165</span>&#160;      (lrt_distMinMedoidsInst,</div><div class="line"><a name="l00166"></a><span class="lineno">  166</span>&#160;       lui,</div><div class="line"><a name="l00167"></a><span class="lineno">  167</span>&#160;       aioarrayui_idxMedoids,</div><div class="line"><a name="l00168"></a><span class="lineno">  168</span>&#160;       aicidx_numKMedoids,</div><div class="line"><a name="l00169"></a><span class="lineno">  169</span>&#160;       aimattriag_dissimilarity</div><div class="line"><a name="l00170"></a><span class="lineno">  170</span>&#160;       );</div><div class="line"><a name="l00171"></a><span class="lineno">  171</span>&#160;    <span class="keywordflow">if</span> (aoarraycidx_memberShip[lui] != lcidx_mj) {</div><div class="line"><a name="l00172"></a><span class="lineno">  172</span>&#160;      ++louintidx_threshold;</div><div class="line"><a name="l00173"></a><span class="lineno">  173</span>&#160;      aoarraycidx_memberShip[lui] = lcidx_mj;</div><div class="line"><a name="l00174"></a><span class="lineno">  174</span>&#160;    }</div><div class="line"><a name="l00175"></a><span class="lineno">  175</span>&#160;    lor_cost += (T_DIST) lrt_distMinMedoidsInst;</div><div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;  }</div><div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;  </div><div class="line"><a name="l00178"></a><span class="lineno">  178</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00180"></a><span class="lineno">  180</span>&#160;    std::cout &lt;&lt; lpc_labelFunc</div><div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;: OUT(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00182"></a><span class="lineno">  182</span>&#160;              &lt;&lt; <span class="stringliteral">&quot; lor_cost = &quot;</span> &lt;&lt; lor_cost</div><div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;              &lt;&lt; <span class="stringliteral">&quot; louintidx_threshold = &quot;</span> &lt;&lt; louintidx_threshold</div><div class="line"><a name="l00184"></a><span class="lineno">  184</span>&#160;              &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div><div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;    std::ostringstream lostrstream_labelMemberShip;</div><div class="line"><a name="l00186"></a><span class="lineno">  186</span>&#160;    lostrstream_labelMemberShip &lt;&lt; <span class="stringliteral">&quot;&lt;MEMBERCLUSTER:&quot;</span> &lt;&lt; geverbosepc_labelstep</div><div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;                                &lt;&lt; <span class="charliteral">&#39;:&#39;</span> &lt;&lt; lpc_labelFunc</div><div class="line"><a name="l00188"></a><span class="lineno">  188</span>&#160;                                &lt;&lt; <span class="stringliteral">&quot;:aoarraycidx_memberShip&lt;&gt;[&quot;</span></div><div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;                                &lt;&lt; aoarraycidx_memberShip&lt;&lt; <span class="charliteral">&#39;]&#39;</span>;</div><div class="line"><a name="l00190"></a><span class="lineno">  190</span>&#160;    <a class="code" href="namespaceinout.html#a0c10a45877a347dec0d4ec4e5b05b828">inout::containerprint</a></div><div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;      (aoarraycidx_memberShip,</div><div class="line"><a name="l00192"></a><span class="lineno">  192</span>&#160;       aoarraycidx_memberShip + aimattriag_dissimilarity.<a class="code" href="classmat_1_1_matrix_triang.html#ae8e385b7959c85519692bdee1d4c3aed">getNumRows</a>(),</div><div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;       std::cout,</div><div class="line"><a name="l00194"></a><span class="lineno">  194</span>&#160;       lostrstream_labelMemberShip.str().c_str(),</div><div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;       <span class="charliteral">&#39;,&#39;</span></div><div class="line"><a name="l00196"></a><span class="lineno">  196</span>&#160;       );</div><div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;    std::cout &lt;&lt; std::endl;           </div><div class="line"><a name="l00198"></a><span class="lineno">  198</span>&#160;  }</div><div class="line"><a name="l00199"></a><span class="lineno">  199</span>&#160;  --geiinparam_verbose;</div><div class="line"><a name="l00200"></a><span class="lineno">  200</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00201"></a><span class="lineno">  201</span>&#160;</div><div class="line"><a name="l00202"></a><span class="lineno">  202</span>&#160;  <span class="keywordflow">return</span>  std::make_pair(lor_cost,louintidx_threshold);</div><div class="line"><a name="l00203"></a><span class="lineno">  203</span>&#160;</div><div class="line"><a name="l00204"></a><span class="lineno">  204</span>&#160;}</div><div class="line"><a name="l00205"></a><span class="lineno">  205</span>&#160;</div><div class="line"><a name="l00215"></a><span class="lineno">  215</span>&#160;<span class="keyword">template</span> &lt; <span class="keyword">typename</span> T_INSTANCEIDX,</div><div class="line"><a name="l00216"></a><span class="lineno">  216</span>&#160;           <span class="keyword">typename</span> T_DIST,</div><div class="line"><a name="l00217"></a><span class="lineno">  217</span>&#160;           <span class="keyword">typename</span> T_CLUSTERIDX    <span class="comment">//-1, 0, 1, .., K</span></div><div class="line"><a name="l00218"></a><span class="lineno">  218</span>&#160;           &gt;</div><div class="line"><a name="l00219"></a><span class="lineno">  219</span>&#160;T_DIST</div><div class="line"><a name="l00220"></a><span class="lineno">  220</span>&#160;<a class="code" href="namespaceclusteringop.html#afe5f3dd79bf850625b0e330cd42873b3">computeTotalCostSwap</a></div><div class="line"><a name="l00221"></a><span class="lineno"><a class="line" href="namespaceclusteringop.html#afe5f3dd79bf850625b0e330cd42873b3">  221</a></span>&#160;(<span class="keyword">const</span> T_INSTANCEIDX              aiuiidx_medoidRand, <span class="comment">/*IS A INDEX TO INSTANCE*/</span> </div><div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160; <span class="keyword">const</span> T_CLUSTERIDX               *aiarraycidx_memberShip,</div><div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160; T_INSTANCEIDX                    *aoarrayuiidx_medoids,</div><div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160; <span class="keyword">const</span> T_CLUSTERIDX               aicidx_numKMedoids,</div><div class="line"><a name="l00225"></a><span class="lineno">  225</span>&#160; <span class="keyword">const</span> <a class="code" href="classmat_1_1_matrix_triang.html">mat::MatrixTriang&lt;T_DIST&gt;</a>  &amp;aimattriag_dissimilarity</div><div class="line"><a name="l00226"></a><span class="lineno">  226</span>&#160; ) </div><div class="line"><a name="l00227"></a><span class="lineno">  227</span>&#160;{</div><div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;  T_DIST          lor_cost;</div><div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;  T_DIST          lrt_minMedoidsRandToInstance_i;</div><div class="line"><a name="l00230"></a><span class="lineno">  230</span>&#160;  T_DIST          lrt_minCurrentClusterKToInstance_i;</div><div class="line"><a name="l00231"></a><span class="lineno">  231</span>&#160;  T_CLUSTERIDX    lcidx_clusterKNonRepre; </div><div class="line"><a name="l00232"></a><span class="lineno">  232</span>&#160;  T_INSTANCEIDX   luintidx_previousMedoids;</div><div class="line"><a name="l00233"></a><span class="lineno">  233</span>&#160;</div><div class="line"><a name="l00234"></a><span class="lineno">  234</span>&#160;  lor_cost = T_DIST(0);</div><div class="line"><a name="l00235"></a><span class="lineno">  235</span>&#160;  </div><div class="line"><a name="l00236"></a><span class="lineno">  236</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00237"></a><span class="lineno">  237</span>&#160;  ++geiinparam_verbose;</div><div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;    std::cout &lt;&lt; <span class="stringliteral">&quot;pamkmedoid_computeTotalCostSwap: IN&quot;</span></div><div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;              &lt;&lt; <span class="charliteral">&#39;(&#39;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="stringliteral">&quot;)\n&quot;</span></div><div class="line"><a name="l00241"></a><span class="lineno">  241</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\t(output lor_cost = &quot;</span> &lt;&lt; lor_cost &lt;&lt; <span class="charliteral">&#39;\n&#39;</span></div><div class="line"><a name="l00242"></a><span class="lineno">  242</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\t input T_INSTANCES_IDX: aiuiidx_medoidRand = &quot;</span> </div><div class="line"><a name="l00243"></a><span class="lineno">  243</span>&#160;              &lt;&lt; aiuiidx_medoidRand &lt;&lt; <span class="charliteral">&#39;\n&#39;</span></div><div class="line"><a name="l00244"></a><span class="lineno">  244</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\t input T_CLUSTERIDX*: aiarraycidx_memberShip[&quot;</span> </div><div class="line"><a name="l00245"></a><span class="lineno">  245</span>&#160;              &lt;&lt; aiarraycidx_memberShip &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span></div><div class="line"><a name="l00246"></a><span class="lineno">  246</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\t input T_INSTANCES_IDX*: aoarrayuiidx_medoids[&quot;</span></div><div class="line"><a name="l00247"></a><span class="lineno">  247</span>&#160;              &lt;&lt; aoarrayuiidx_medoids &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span></div><div class="line"><a name="l00248"></a><span class="lineno">  248</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\t input T_CLUSTERIDX: aicidx_numKMedoids = &quot;</span> </div><div class="line"><a name="l00249"></a><span class="lineno">  249</span>&#160;              &lt;&lt; aicidx_numKMedoids &lt;&lt; <span class="charliteral">&#39;\n&#39;</span></div><div class="line"><a name="l00250"></a><span class="lineno">  250</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\t input  mat::MatrixTriang: aimattriag_dissimilarity[&quot;</span>  </div><div class="line"><a name="l00251"></a><span class="lineno">  251</span>&#160;              &lt;&lt;  &amp;aimattriag_dissimilarity &lt;&lt; <span class="stringliteral">&quot;]\n&quot;</span></div><div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\t)\n&quot;</span>;</div><div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;  }</div><div class="line"><a name="l00254"></a><span class="lineno">  254</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES */</span><span class="preprocessor"></span></div><div class="line"><a name="l00255"></a><span class="lineno">  255</span>&#160;</div><div class="line"><a name="l00256"></a><span class="lineno">  256</span>&#160;  lcidx_clusterKNonRepre = aiarraycidx_memberShip[ aiuiidx_medoidRand ];</div><div class="line"><a name="l00257"></a><span class="lineno">  257</span>&#160;  luintidx_previousMedoids = aoarrayuiidx_medoids[lcidx_clusterKNonRepre];</div><div class="line"><a name="l00258"></a><span class="lineno">  258</span>&#160;  aoarrayuiidx_medoids[lcidx_clusterKNonRepre] = aiuiidx_medoidRand;</div><div class="line"><a name="l00259"></a><span class="lineno">  259</span>&#160;</div><div class="line"><a name="l00260"></a><span class="lineno">  260</span>&#160;  <span class="keywordflow">for</span> (T_INSTANCEIDX lui_i = 0; lui_i &lt; aimattriag_dissimilarity.<a class="code" href="classmat_1_1_matrix_triang.html#ae8e385b7959c85519692bdee1d4c3aed">getNumRows</a>(); lui_i++) {</div><div class="line"><a name="l00261"></a><span class="lineno">  261</span>&#160;    <span class="keywordflow">if</span> ( lcidx_clusterKNonRepre == aiarraycidx_memberShip[lui_i] ) {</div><div class="line"><a name="l00262"></a><span class="lineno">  262</span>&#160;      <span class="comment">/* FIND DISTANCE NEAREST CONSY */</span></div><div class="line"><a name="l00263"></a><span class="lineno">  263</span>&#160;      <a class="code" href="namespacenearest.html#a3c4239101cf18ab4ca62e654a4179995">nearest::medoidsNN</a> </div><div class="line"><a name="l00264"></a><span class="lineno">  264</span>&#160;        (lrt_minCurrentClusterKToInstance_i,</div><div class="line"><a name="l00265"></a><span class="lineno">  265</span>&#160;         lui_i,</div><div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;         aoarrayuiidx_medoids,</div><div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;         aicidx_numKMedoids,</div><div class="line"><a name="l00268"></a><span class="lineno">  268</span>&#160;         aimattriag_dissimilarity</div><div class="line"><a name="l00269"></a><span class="lineno">  269</span>&#160;         );</div><div class="line"><a name="l00270"></a><span class="lineno">  270</span>&#160;    }</div><div class="line"><a name="l00271"></a><span class="lineno">  271</span>&#160;    <span class="keywordflow">else</span> {</div><div class="line"><a name="l00272"></a><span class="lineno">  272</span>&#160;      T_INSTANCEIDX luintidx_clusterKcurrentInsti = </div><div class="line"><a name="l00273"></a><span class="lineno">  273</span>&#160;        aoarrayuiidx_medoids[aiarraycidx_memberShip[lui_i]];</div><div class="line"><a name="l00274"></a><span class="lineno">  274</span>&#160; </div><div class="line"><a name="l00275"></a><span class="lineno">  275</span>&#160;      lrt_minCurrentClusterKToInstance_i = </div><div class="line"><a name="l00276"></a><span class="lineno">  276</span>&#160;        ( lui_i &gt; luintidx_clusterKcurrentInsti)?</div><div class="line"><a name="l00277"></a><span class="lineno">  277</span>&#160;        aimattriag_dissimilarity( lui_i, luintidx_clusterKcurrentInsti ):</div><div class="line"><a name="l00278"></a><span class="lineno">  278</span>&#160;        aimattriag_dissimilarity( luintidx_clusterKcurrentInsti, lui_i );</div><div class="line"><a name="l00279"></a><span class="lineno">  279</span>&#160;      </div><div class="line"><a name="l00280"></a><span class="lineno">  280</span>&#160;      lrt_minMedoidsRandToInstance_i = (lui_i &gt; aiuiidx_medoidRand)?</div><div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;        aimattriag_dissimilarity( lui_i, aiuiidx_medoidRand ):</div><div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;        aimattriag_dissimilarity( aiuiidx_medoidRand, lui_i );</div><div class="line"><a name="l00283"></a><span class="lineno">  283</span>&#160;</div><div class="line"><a name="l00284"></a><span class="lineno">  284</span>&#160;      <span class="keywordflow">if</span> ( lrt_minMedoidsRandToInstance_i &lt; lrt_minCurrentClusterKToInstance_i )</div><div class="line"><a name="l00285"></a><span class="lineno">  285</span>&#160;        lrt_minCurrentClusterKToInstance_i = lrt_minMedoidsRandToInstance_i;</div><div class="line"><a name="l00286"></a><span class="lineno">  286</span>&#160;    }</div><div class="line"><a name="l00287"></a><span class="lineno">  287</span>&#160;    lor_cost += (T_DIST) lrt_minCurrentClusterKToInstance_i;</div><div class="line"><a name="l00288"></a><span class="lineno">  288</span>&#160;  }</div><div class="line"><a name="l00289"></a><span class="lineno">  289</span>&#160;  </div><div class="line"><a name="l00290"></a><span class="lineno">  290</span>&#160;  aoarrayuiidx_medoids[lcidx_clusterKNonRepre] = luintidx_previousMedoids;</div><div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;</div><div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00294"></a><span class="lineno">  294</span>&#160;    std::cout &lt;&lt; <span class="stringliteral">&quot;pamkmedoid_computeTotalCostSwap: OUT&quot;</span></div><div class="line"><a name="l00295"></a><span class="lineno">  295</span>&#160;              &lt;&lt; <span class="charliteral">&#39;(&#39;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span></div><div class="line"><a name="l00296"></a><span class="lineno">  296</span>&#160;              &lt;&lt; <span class="stringliteral">&quot; lor_cost = &quot;</span> &lt;&lt; lor_cost &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div><div class="line"><a name="l00297"></a><span class="lineno">  297</span>&#160;  }</div><div class="line"><a name="l00298"></a><span class="lineno">  298</span>&#160;  --geiinparam_verbose;</div><div class="line"><a name="l00299"></a><span class="lineno">  299</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00300"></a><span class="lineno">  300</span>&#160;</div><div class="line"><a name="l00301"></a><span class="lineno">  301</span>&#160;  <span class="keywordflow">return</span> lor_cost;</div><div class="line"><a name="l00302"></a><span class="lineno">  302</span>&#160;</div><div class="line"><a name="l00303"></a><span class="lineno">  303</span>&#160;}</div><div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;</div><div class="line"><a name="l00313"></a><span class="lineno">  313</span>&#160;<span class="keyword">template</span>  &lt; <span class="keyword">typename</span> T_INSTANCEIDX,</div><div class="line"><a name="l00314"></a><span class="lineno">  314</span>&#160;            <span class="keyword">typename</span> T_DIST,</div><div class="line"><a name="l00315"></a><span class="lineno">  315</span>&#160;            <span class="keyword">typename</span> T_CLUSTERIDX <span class="comment">//-1, 0, 1, .., K</span></div><div class="line"><a name="l00316"></a><span class="lineno">  316</span>&#160;           &gt;</div><div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;T_DIST</div><div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;<a class="code" href="namespaceclusteringop.html#a2543f9db12028d26cf5eb603370baa52">computeCostInstanceClusterJ</a></div><div class="line"><a name="l00319"></a><span class="lineno"><a class="line" href="namespaceclusteringop.html#a2543f9db12028d26cf5eb603370baa52">  319</a></span>&#160;(T_INSTANCEIDX              aiuintidx_medoids, </div><div class="line"><a name="l00320"></a><span class="lineno">  320</span>&#160; T_CLUSTERIDX               aicidx_Cj,</div><div class="line"><a name="l00321"></a><span class="lineno">  321</span>&#160;  <a class="code" href="classds_1_1_partition_linked.html">ds::PartitionLinked</a>       <span class="comment">/*Relation each object in X to the cluster Cj*/</span></div><div class="line"><a name="l00322"></a><span class="lineno">  322</span>&#160; &lt;T_CLUSTERIDX&gt;             &amp;aipartlink_partition,           </div><div class="line"><a name="l00323"></a><span class="lineno">  323</span>&#160; <a class="code" href="classmat_1_1_matrix_triang.html">mat::MatrixTriang&lt;T_DIST&gt;</a>  &amp;aimattriag_dissimilarity</div><div class="line"><a name="l00324"></a><span class="lineno">  324</span>&#160; )</div><div class="line"><a name="l00325"></a><span class="lineno">  325</span>&#160;{</div><div class="line"><a name="l00326"></a><span class="lineno">  326</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00327"></a><span class="lineno">  327</span>&#160;  <span class="keyword">const</span> <span class="keywordtype">char</span>* lpc_labelFunc = <span class="stringliteral">&quot;clusteringop::computeCostInstanceClusterJ&quot;</span>;</div><div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;  ++geiinparam_verbose;</div><div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00330"></a><span class="lineno">  330</span>&#160;    std::cout &lt;&lt; lpc_labelFunc </div><div class="line"><a name="l00331"></a><span class="lineno">  331</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;:  IN(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="stringliteral">&quot;)\n&quot;</span> </div><div class="line"><a name="l00332"></a><span class="lineno">  332</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;As more respresentatico: &quot;</span> &lt;&lt; aiuintidx_medoids </div><div class="line"><a name="l00333"></a><span class="lineno">  333</span>&#160;              &lt;&lt; <span class="stringliteral">&quot; in C_&quot;</span> &lt;&lt; aicidx_Cj</div><div class="line"><a name="l00334"></a><span class="lineno">  334</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n)&quot;</span></div><div class="line"><a name="l00335"></a><span class="lineno">  335</span>&#160;              &lt;&lt; std::endl;</div><div class="line"><a name="l00336"></a><span class="lineno">  336</span>&#160;  }</div><div class="line"><a name="l00337"></a><span class="lineno">  337</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00338"></a><span class="lineno">  338</span>&#160;</div><div class="line"><a name="l00339"></a><span class="lineno">  339</span>&#160;  T_DIST  lor_costCj;</div><div class="line"><a name="l00340"></a><span class="lineno">  340</span>&#160;  T_DIST  lrt_instancesij;</div><div class="line"><a name="l00341"></a><span class="lineno">  341</span>&#160;  <a class="code" href="classds_1_1_iterator_partition_linked.html">ds::IteratorPartitionLinked&lt;T_CLUSTERIDX&gt;</a>  literpart_j(&amp;aipartlink_partition);</div><div class="line"><a name="l00342"></a><span class="lineno">  342</span>&#160;  </div><div class="line"><a name="l00343"></a><span class="lineno">  343</span>&#160;  lor_costCj = T_DIST(0);</div><div class="line"><a name="l00344"></a><span class="lineno">  344</span>&#160;  <span class="keywordflow">for</span> (literpart_j.<a class="code" href="classds_1_1_iterator_partition_linked.html#ad171cb96653fadaec272389381a4f8b4">begin</a>(aicidx_Cj);literpart_j.<a class="code" href="classds_1_1_iterator_partition_linked.html#af0e179fae69c0d4f047082ee44783613">end</a>();literpart_j.<a class="code" href="classds_1_1_iterator_partition_linked.html#a83b887be41c97dc0bdfc47a02abbc383">next</a>() ) {</div><div class="line"><a name="l00345"></a><span class="lineno">  345</span>&#160;      lrt_instancesij = (aiuintidx_medoids&gt;literpart_j.<a class="code" href="classds_1_1_iterator_partition_linked.html#a1a031c033d0d2d1c6982ced4e0473831">getValue</a>())?</div><div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;        aimattriag_dissimilarity</div><div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;        (aiuintidx_medoids,literpart_j.<a class="code" href="classds_1_1_iterator_partition_linked.html#a1a031c033d0d2d1c6982ced4e0473831">getValue</a>()):</div><div class="line"><a name="l00348"></a><span class="lineno">  348</span>&#160;        aimattriag_dissimilarity</div><div class="line"><a name="l00349"></a><span class="lineno">  349</span>&#160;        (literpart_j.<a class="code" href="classds_1_1_iterator_partition_linked.html#a1a031c033d0d2d1c6982ced4e0473831">getValue</a>(),aiuintidx_medoids);</div><div class="line"><a name="l00350"></a><span class="lineno">  350</span>&#160;      lor_costCj += (T_DIST) lrt_instancesij;</div><div class="line"><a name="l00351"></a><span class="lineno">  351</span>&#160;    }</div><div class="line"><a name="l00352"></a><span class="lineno">  352</span>&#160;</div><div class="line"><a name="l00353"></a><span class="lineno">  353</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00354"></a><span class="lineno">  354</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00355"></a><span class="lineno">  355</span>&#160;    std::cout &lt;&lt; lpc_labelFunc</div><div class="line"><a name="l00356"></a><span class="lineno">  356</span>&#160;              &lt;&lt;<span class="stringliteral">&quot;: OUT(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="charliteral">&#39;)&#39;</span> </div><div class="line"><a name="l00357"></a><span class="lineno">  357</span>&#160;              &lt;&lt; <span class="stringliteral">&quot; lor_costCj = &quot;</span> &lt;&lt; lor_costCj &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div><div class="line"><a name="l00358"></a><span class="lineno">  358</span>&#160;  }</div><div class="line"><a name="l00359"></a><span class="lineno">  359</span>&#160;  --geiinparam_verbose;</div><div class="line"><a name="l00360"></a><span class="lineno">  360</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00361"></a><span class="lineno">  361</span>&#160;</div><div class="line"><a name="l00362"></a><span class="lineno">  362</span>&#160;  <span class="keywordflow">return</span> lor_costCj;</div><div class="line"><a name="l00363"></a><span class="lineno">  363</span>&#160;}</div><div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;</div><div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160;</div><div class="line"><a name="l00383"></a><span class="lineno">  383</span>&#160;<span class="keyword">template</span>  &lt;<span class="keyword">typename</span> T_INSTANCEIDX,</div><div class="line"><a name="l00384"></a><span class="lineno">  384</span>&#160;           <span class="keyword">typename</span> T_DIST,</div><div class="line"><a name="l00385"></a><span class="lineno">  385</span>&#160;           <span class="keyword">typename</span> T_CLUSTERIDX <span class="comment">//-1, 0, 1, .., K</span></div><div class="line"><a name="l00386"></a><span class="lineno">  386</span>&#160;           &gt;</div><div class="line"><a name="l00387"></a><span class="lineno">  387</span>&#160;T_DIST</div><div class="line"><a name="l00388"></a><span class="lineno">  388</span>&#160;<a class="code" href="namespaceclusteringop.html#ac88386dee7f9622d967508e4111fa2e5">updateMedoids</a></div><div class="line"><a name="l00389"></a><span class="lineno"><a class="line" href="namespaceclusteringop.html#ac88386dee7f9622d967508e4111fa2e5">  389</a></span>&#160;(T_INSTANCEIDX                      *aioarrayui_idxMedoids, </div><div class="line"><a name="l00390"></a><span class="lineno">  390</span>&#160; <span class="keyword">const</span> T_CLUSTERIDX                 aicidx_numKMedoids,</div><div class="line"><a name="l00391"></a><span class="lineno">  391</span>&#160; <span class="keyword">const</span> T_INSTANCEIDX                aiu_nearestNeighborsP,</div><div class="line"><a name="l00392"></a><span class="lineno">  392</span>&#160; <a class="code" href="classmat_1_1_matrix_triang.html">mat::MatrixTriang&lt;T_DIST&gt;</a>          &amp;aimattriag_dissimilarity</div><div class="line"><a name="l00393"></a><span class="lineno">  393</span>&#160; )</div><div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;{</div><div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00396"></a><span class="lineno">  396</span>&#160;  <span class="keyword">const</span> <span class="keywordtype">char</span>* lpc_labelFunc = <span class="stringliteral">&quot;clusteringop::updateMedoids&quot;</span>;</div><div class="line"><a name="l00397"></a><span class="lineno">  397</span>&#160;  ++geiinparam_verbose;</div><div class="line"><a name="l00398"></a><span class="lineno">  398</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00399"></a><span class="lineno">  399</span>&#160;    std::cout &lt;&lt; lpc_labelFunc </div><div class="line"><a name="l00400"></a><span class="lineno">  400</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;:  IN(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="stringliteral">&quot;)\n&quot;</span>;</div><div class="line"><a name="l00401"></a><span class="lineno">  401</span>&#160;    std::ostringstream lostrstream_labelMedoids;</div><div class="line"><a name="l00402"></a><span class="lineno">  402</span>&#160;    lostrstream_labelMedoids &lt;&lt; <span class="stringliteral">&quot;&lt;MEDOIDS:&quot;</span></div><div class="line"><a name="l00403"></a><span class="lineno">  403</span>&#160;                             &lt;&lt; lpc_labelFunc;</div><div class="line"><a name="l00404"></a><span class="lineno">  404</span>&#160;    <a class="code" href="namespaceinout.html#a0c10a45877a347dec0d4ec4e5b05b828">inout::containerprint</a></div><div class="line"><a name="l00405"></a><span class="lineno">  405</span>&#160;      (aioarrayui_idxMedoids,</div><div class="line"><a name="l00406"></a><span class="lineno">  406</span>&#160;       aioarrayui_idxMedoids + (T_INSTANCEIDX) aicidx_numKMedoids,</div><div class="line"><a name="l00407"></a><span class="lineno">  407</span>&#160;       std::cout,</div><div class="line"><a name="l00408"></a><span class="lineno">  408</span>&#160;       lostrstream_labelMedoids.str().c_str(),</div><div class="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;       <span class="charliteral">&#39;,&#39;</span></div><div class="line"><a name="l00410"></a><span class="lineno">  410</span>&#160;       ); </div><div class="line"><a name="l00411"></a><span class="lineno">  411</span>&#160;    std::cout &lt;&lt; <span class="stringliteral">&quot;\n input  T_INSTANCEIDX: aiu_nearestNeighborsP = &quot;</span> </div><div class="line"><a name="l00412"></a><span class="lineno">  412</span>&#160;              &lt;&lt; aiu_nearestNeighborsP</div><div class="line"><a name="l00413"></a><span class="lineno">  413</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n input  MatrixTriang: aiinstf_instances[&quot;</span> &lt;&lt;  &amp;aimattriag_dissimilarity</div><div class="line"><a name="l00414"></a><span class="lineno">  414</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;\n)&quot;</span></div><div class="line"><a name="l00415"></a><span class="lineno">  415</span>&#160;              &lt;&lt; std::endl;</div><div class="line"><a name="l00416"></a><span class="lineno">  416</span>&#160;    T_DIST lt_objetiveFunc = </div><div class="line"><a name="l00417"></a><span class="lineno">  417</span>&#160;      <a class="code" href="namespaceum.html#ad23c0567fb4c517ab9eaa0134af14bb5">um::SSEMedoid</a></div><div class="line"><a name="l00418"></a><span class="lineno">  418</span>&#160;      (aioarrayui_idxMedoids, </div><div class="line"><a name="l00419"></a><span class="lineno">  419</span>&#160;       aicidx_numKMedoids,</div><div class="line"><a name="l00420"></a><span class="lineno">  420</span>&#160;       aimattriag_dissimilarity</div><div class="line"><a name="l00421"></a><span class="lineno">  421</span>&#160;       );</div><div class="line"><a name="l00422"></a><span class="lineno">  422</span>&#160;    std::cout &lt;&lt; <span class="stringliteral">&quot;lt_objetiveFunc: &quot;</span> &lt;&lt; lt_objetiveFunc &lt;&lt; std::endl;</div><div class="line"><a name="l00423"></a><span class="lineno">  423</span>&#160;  }</div><div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;</div><div class="line"><a name="l00426"></a><span class="lineno">  426</span>&#160;  <span class="comment">/*Vector to store the Mj closest to Cj</span></div><div class="line"><a name="l00427"></a><span class="lineno">  427</span>&#160;<span class="comment">   */</span></div><div class="line"><a name="l00428"></a><span class="lineno">  428</span>&#160;  std::vector&lt;T_INSTANCEIDX&gt; lvectorui_subsetCjNearestMj(aiu_nearestNeighborsP);</div><div class="line"><a name="l00429"></a><span class="lineno">  429</span>&#160;  <a class="code" href="classmat_1_1_bit_array.html">mat::BitArray&lt;unsigned long&gt;</a>   </div><div class="line"><a name="l00430"></a><span class="lineno">  430</span>&#160;    lbitarray_medoidEvaluate</div><div class="line"><a name="l00431"></a><span class="lineno">  431</span>&#160;    (aimattriag_dissimilarity.<a class="code" href="classmat_1_1_matrix_triang.html#ae8e385b7959c85519692bdee1d4c3aed">getNumRows</a>());</div><div class="line"><a name="l00432"></a><span class="lineno">  432</span>&#160;  T_DIST lor_cost = T_DIST(0);</div><div class="line"><a name="l00433"></a><span class="lineno">  433</span>&#160;  <span class="keywordtype">bool</span> lb_medoidChange;</div><div class="line"><a name="l00434"></a><span class="lineno">  434</span>&#160;</div><div class="line"><a name="l00435"></a><span class="lineno">  435</span>&#160;  <span class="keywordflow">do</span> {</div><div class="line"><a name="l00436"></a><span class="lineno">  436</span>&#160;</div><div class="line"><a name="l00437"></a><span class="lineno">  437</span>&#160;    lb_medoidChange = <span class="keyword">false</span>;</div><div class="line"><a name="l00438"></a><span class="lineno">  438</span>&#160;</div><div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160;    <span class="comment">/* Assign each object in X to the cluster Cj with the</span></div><div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;<span class="comment">      closest medoid under Euclidean distance metric.</span></div><div class="line"><a name="l00441"></a><span class="lineno">  441</span>&#160;<span class="comment">    */</span></div><div class="line"><a name="l00442"></a><span class="lineno">  442</span>&#160;    <a class="code" href="classds_1_1_partition_linked.html">ds::PartitionLinked  &lt;T_CLUSTERIDX&gt;</a>  lpartlink_partition;</div><div class="line"><a name="l00443"></a><span class="lineno">  443</span>&#160;    std::tie(lor_cost, lpartlink_partition) =</div><div class="line"><a name="l00444"></a><span class="lineno">  444</span>&#160;      <a class="code" href="namespaceclusteringop.html#a9811c142c169af0321631f773797089c">nearestRepresentative</a></div><div class="line"><a name="l00445"></a><span class="lineno">  445</span>&#160;      (aioarrayui_idxMedoids,</div><div class="line"><a name="l00446"></a><span class="lineno">  446</span>&#160;       aicidx_numKMedoids,</div><div class="line"><a name="l00447"></a><span class="lineno">  447</span>&#160;       aimattriag_dissimilarity</div><div class="line"><a name="l00448"></a><span class="lineno">  448</span>&#160;       );</div><div class="line"><a name="l00449"></a><span class="lineno">  449</span>&#160;    lbitarray_medoidEvaluate.initialize();</div><div class="line"><a name="l00450"></a><span class="lineno">  450</span>&#160;    </div><div class="line"><a name="l00451"></a><span class="lineno">  451</span>&#160;    <a class="code" href="classds_1_1_iterator_partition_linked.html">ds::IteratorPartitionLinked&lt;T_CLUSTERIDX&gt;</a>   literpart_j(&amp;lpartlink_partition);</div><div class="line"><a name="l00452"></a><span class="lineno">  452</span>&#160;</div><div class="line"><a name="l00453"></a><span class="lineno">  453</span>&#160;     <span class="comment">/*Update k medoids. For j=1 to the number de cluster k do</span></div><div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;<span class="comment">      */</span></div><div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;    <span class="keywordflow">for</span> ( T_CLUSTERIDX lcidx_Cj = 0; lcidx_Cj &lt; aicidx_numKMedoids;  lcidx_Cj++ ) </div><div class="line"><a name="l00456"></a><span class="lineno">  456</span>&#160;      {</div><div class="line"><a name="l00457"></a><span class="lineno">  457</span>&#160;</div><div class="line"><a name="l00458"></a><span class="lineno">  458</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00459"></a><span class="lineno">  459</span>&#160;        ++geiinparam_verbose;</div><div class="line"><a name="l00460"></a><span class="lineno">  460</span>&#160;        <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax  ) {</div><div class="line"><a name="l00461"></a><span class="lineno">  461</span>&#160;          std::cout &lt;&lt; <span class="stringliteral">&quot;Search for Medoids: &quot;</span> &lt;&lt; aioarrayui_idxMedoids[lcidx_Cj] </div><div class="line"><a name="l00462"></a><span class="lineno">  462</span>&#160;                    &lt;&lt; <span class="stringliteral">&quot; in C_&quot;</span> &lt;&lt; lcidx_Cj &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div><div class="line"><a name="l00463"></a><span class="lineno">  463</span>&#160;        }</div><div class="line"><a name="l00464"></a><span class="lineno">  464</span>&#160;        --geiinparam_verbose;</div><div class="line"><a name="l00465"></a><span class="lineno">  465</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00466"></a><span class="lineno">  466</span>&#160;      </div><div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;</div><div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;        <span class="comment">/*Which have no been evaluated</span></div><div class="line"><a name="l00469"></a><span class="lineno">  469</span>&#160;<span class="comment">          before current iteration</span></div><div class="line"><a name="l00470"></a><span class="lineno">  470</span>&#160;<span class="comment">         */</span></div><div class="line"><a name="l00471"></a><span class="lineno">  471</span>&#160;        lbitarray_medoidEvaluate.setBit(aioarrayui_idxMedoids[lcidx_Cj]);</div><div class="line"><a name="l00472"></a><span class="lineno">  472</span>&#160;</div><div class="line"><a name="l00473"></a><span class="lineno">  473</span>&#160;        <span class="comment">/*a) Within the cluster Cj, choose a subset Cs</span></div><div class="line"><a name="l00474"></a><span class="lineno">  474</span>&#160;<span class="comment">          that corresponds to m, and its p nearest</span></div><div class="line"><a name="l00475"></a><span class="lineno">  475</span>&#160;<span class="comment">          neighbors (which have no been evaluated</span></div><div class="line"><a name="l00476"></a><span class="lineno">  476</span>&#160;<span class="comment">          before current iteration) of m,.</span></div><div class="line"><a name="l00477"></a><span class="lineno">  477</span>&#160;<span class="comment">        */</span></div><div class="line"><a name="l00478"></a><span class="lineno">  478</span>&#160;        <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; xkinSubsetCj: lvectorui_subsetCjNearestMj) {</div><div class="line"><a name="l00479"></a><span class="lineno">  479</span>&#160;          <span class="comment">/*SEARCH Csubset p Nearest neighbors*/</span></div><div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;          xkinSubsetCj = <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a>;</div><div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;          T_DIST lt_distMinXkinSubsetCj = std::numeric_limits&lt;T_DIST&gt;::max();</div><div class="line"><a name="l00482"></a><span class="lineno">  482</span>&#160;          <span class="keywordflow">for</span> ( literpart_j.<a class="code" href="classds_1_1_iterator_partition_linked.html#ad171cb96653fadaec272389381a4f8b4">begin</a>(lcidx_Cj); literpart_j.<a class="code" href="classds_1_1_iterator_partition_linked.html#af0e179fae69c0d4f047082ee44783613">end</a>(); literpart_j.<a class="code" href="classds_1_1_iterator_partition_linked.html#a83b887be41c97dc0bdfc47a02abbc383">next</a>() ) {</div><div class="line"><a name="l00483"></a><span class="lineno">  483</span>&#160;            <span class="keywordflow">if</span> ( !lbitarray_medoidEvaluate.getBit(literpart_j.<a class="code" href="classds_1_1_iterator_partition_linked.html#a1a031c033d0d2d1c6982ced4e0473831">getValue</a>()) ) {</div><div class="line"><a name="l00484"></a><span class="lineno">  484</span>&#160;              T_DIST lt_distmjtoP = </div><div class="line"><a name="l00485"></a><span class="lineno">  485</span>&#160;                (aioarrayui_idxMedoids[lcidx_Cj]&gt;literpart_j.<a class="code" href="classds_1_1_iterator_partition_linked.html#a1a031c033d0d2d1c6982ced4e0473831">getValue</a>())?</div><div class="line"><a name="l00486"></a><span class="lineno">  486</span>&#160;                aimattriag_dissimilarity</div><div class="line"><a name="l00487"></a><span class="lineno">  487</span>&#160;                (aioarrayui_idxMedoids[lcidx_Cj],literpart_j.<a class="code" href="classds_1_1_iterator_partition_linked.html#a1a031c033d0d2d1c6982ced4e0473831">getValue</a>()):</div><div class="line"><a name="l00488"></a><span class="lineno">  488</span>&#160;                aimattriag_dissimilarity</div><div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;                (literpart_j.<a class="code" href="classds_1_1_iterator_partition_linked.html#a1a031c033d0d2d1c6982ced4e0473831">getValue</a>(),aioarrayui_idxMedoids[lcidx_Cj]);</div><div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;              <span class="keywordflow">if</span> ( lt_distmjtoP &lt; lt_distMinXkinSubsetCj ) {</div><div class="line"><a name="l00491"></a><span class="lineno">  491</span>&#160;                xkinSubsetCj  = literpart_j.<a class="code" href="classds_1_1_iterator_partition_linked.html#a1a031c033d0d2d1c6982ced4e0473831">getValue</a>();</div><div class="line"><a name="l00492"></a><span class="lineno">  492</span>&#160;                lt_distMinXkinSubsetCj = lt_distmjtoP;</div><div class="line"><a name="l00493"></a><span class="lineno">  493</span>&#160;                </div><div class="line"><a name="l00494"></a><span class="lineno">  494</span>&#160;              }</div><div class="line"><a name="l00495"></a><span class="lineno">  495</span>&#160;            }</div><div class="line"><a name="l00496"></a><span class="lineno">  496</span>&#160;          }</div><div class="line"><a name="l00497"></a><span class="lineno">  497</span>&#160;          <span class="keywordflow">if</span> (xkinSubsetCj != <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a>) {</div><div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;            lbitarray_medoidEvaluate.setBit(xkinSubsetCj);</div><div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;          }</div><div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;        }</div><div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;</div><div class="line"><a name="l00502"></a><span class="lineno">  502</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00503"></a><span class="lineno">  503</span>&#160;        ++geiinparam_verbose;</div><div class="line"><a name="l00504"></a><span class="lineno">  504</span>&#160;        <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00505"></a><span class="lineno">  505</span>&#160;</div><div class="line"><a name="l00506"></a><span class="lineno">  506</span>&#160;          std::ostringstream lostrstream_subsetCjNearestMj;</div><div class="line"><a name="l00507"></a><span class="lineno">  507</span>&#160;          lostrstream_subsetCjNearestMj &lt;&lt; <span class="stringliteral">&quot;&lt;SUBSETCJNEARESTMJ:&quot;</span></div><div class="line"><a name="l00508"></a><span class="lineno">  508</span>&#160;                                        &lt;&lt; lpc_labelFunc;</div><div class="line"><a name="l00509"></a><span class="lineno">  509</span>&#160;          <a class="code" href="namespaceinout.html#a0c10a45877a347dec0d4ec4e5b05b828">inout::containerprint</a></div><div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;            (lvectorui_subsetCjNearestMj.begin(),</div><div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;             lvectorui_subsetCjNearestMj.end(),</div><div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;             std::cout,</div><div class="line"><a name="l00513"></a><span class="lineno">  513</span>&#160;             lostrstream_subsetCjNearestMj.str().c_str(),</div><div class="line"><a name="l00514"></a><span class="lineno">  514</span>&#160;             <span class="charliteral">&#39;,&#39;</span></div><div class="line"><a name="l00515"></a><span class="lineno">  515</span>&#160;             ); </div><div class="line"><a name="l00516"></a><span class="lineno">  516</span>&#160;          std::cout &lt;&lt; std::endl;</div><div class="line"><a name="l00517"></a><span class="lineno">  517</span>&#160;        }</div><div class="line"><a name="l00518"></a><span class="lineno">  518</span>&#160;        --geiinparam_verbose;</div><div class="line"><a name="l00519"></a><span class="lineno">  519</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00520"></a><span class="lineno">  520</span>&#160;</div><div class="line"><a name="l00521"></a><span class="lineno">  521</span>&#160;        <span class="comment">/*b) Calculate cost for the new medoid</span></div><div class="line"><a name="l00522"></a><span class="lineno">  522</span>&#160;<span class="comment">         */</span></div><div class="line"><a name="l00523"></a><span class="lineno">  523</span>&#160;        T_INSTANCEIDX lui_idxInstNewMj = aioarrayui_idxMedoids[lcidx_Cj];</div><div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;        T_DIST lrt_MjSumD = </div><div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160;          <a class="code" href="namespaceclusteringop.html#a2543f9db12028d26cf5eb603370baa52">computeCostInstanceClusterJ</a></div><div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160;          (lui_idxInstNewMj,</div><div class="line"><a name="l00527"></a><span class="lineno">  527</span>&#160;           lcidx_Cj,</div><div class="line"><a name="l00528"></a><span class="lineno">  528</span>&#160;           lpartlink_partition, </div><div class="line"><a name="l00529"></a><span class="lineno">  529</span>&#160;           aimattriag_dissimilarity</div><div class="line"><a name="l00530"></a><span class="lineno">  530</span>&#160;           );</div><div class="line"><a name="l00531"></a><span class="lineno">  531</span>&#160;        <span class="keywordflow">for</span> (<span class="keyword">auto</span>&amp; xkinSubsetCj: lvectorui_subsetCjNearestMj) {</div><div class="line"><a name="l00532"></a><span class="lineno">  532</span>&#160;          <span class="keywordflow">if</span> ( xkinSubsetCj != <a class="code" href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a> ) {</div><div class="line"><a name="l00533"></a><span class="lineno">  533</span>&#160;            T_DIST lrt_xkinSubsetCjSumD = </div><div class="line"><a name="l00534"></a><span class="lineno">  534</span>&#160;              <a class="code" href="namespaceclusteringop.html#a2543f9db12028d26cf5eb603370baa52">computeCostInstanceClusterJ</a></div><div class="line"><a name="l00535"></a><span class="lineno">  535</span>&#160;              (xkinSubsetCj,</div><div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160;               lcidx_Cj,</div><div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160;               lpartlink_partition, </div><div class="line"><a name="l00538"></a><span class="lineno">  538</span>&#160;               aimattriag_dissimilarity</div><div class="line"><a name="l00539"></a><span class="lineno">  539</span>&#160;               );</div><div class="line"><a name="l00540"></a><span class="lineno">  540</span>&#160;            <span class="keywordflow">if</span> ( lrt_xkinSubsetCjSumD &lt; lrt_MjSumD ) {</div><div class="line"><a name="l00541"></a><span class="lineno">  541</span>&#160;              lui_idxInstNewMj = xkinSubsetCj;</div><div class="line"><a name="l00542"></a><span class="lineno">  542</span>&#160;              lrt_MjSumD = lrt_xkinSubsetCjSumD;</div><div class="line"><a name="l00543"></a><span class="lineno">  543</span>&#160;            }</div><div class="line"><a name="l00544"></a><span class="lineno">  544</span>&#160;          }</div><div class="line"><a name="l00545"></a><span class="lineno">  545</span>&#160;        }</div><div class="line"><a name="l00546"></a><span class="lineno">  546</span>&#160;</div><div class="line"><a name="l00547"></a><span class="lineno">  547</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00548"></a><span class="lineno">  548</span>&#160;        ++geiinparam_verbose;</div><div class="line"><a name="l00549"></a><span class="lineno">  549</span>&#160;        <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00550"></a><span class="lineno">  550</span>&#160;          std::cout &lt;&lt; <span class="stringliteral">&quot;lrt_MjSumD: &quot;</span> &lt;&lt; lrt_MjSumD</div><div class="line"><a name="l00551"></a><span class="lineno">  551</span>&#160;                    &lt;&lt; <span class="stringliteral">&quot; aioarrayui_idxMedoids[lcidx_Cj]: &quot;</span> &lt;&lt; aioarrayui_idxMedoids[lcidx_Cj]  </div><div class="line"><a name="l00552"></a><span class="lineno">  552</span>&#160;                    &lt;&lt; <span class="stringliteral">&quot; lui_idxInstNewMj: &quot;</span> &lt;&lt; lui_idxInstNewMj  </div><div class="line"><a name="l00553"></a><span class="lineno">  553</span>&#160;                    &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div><div class="line"><a name="l00554"></a><span class="lineno">  554</span>&#160;        }</div><div class="line"><a name="l00555"></a><span class="lineno">  555</span>&#160;        --geiinparam_verbose;</div><div class="line"><a name="l00556"></a><span class="lineno">  556</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00557"></a><span class="lineno">  557</span>&#160;</div><div class="line"><a name="l00558"></a><span class="lineno">  558</span>&#160;        <span class="comment">/*It replaces the new Mj found with lower cost, because of the previous</span></div><div class="line"><a name="l00559"></a><span class="lineno">  559</span>&#160;<span class="comment">         */</span></div><div class="line"><a name="l00560"></a><span class="lineno">  560</span>&#160;        <span class="keywordflow">if</span> ( lui_idxInstNewMj != aioarrayui_idxMedoids[lcidx_Cj]  ) {</div><div class="line"><a name="l00561"></a><span class="lineno">  561</span>&#160;          aioarrayui_idxMedoids[lcidx_Cj] =  lui_idxInstNewMj; </div><div class="line"><a name="l00562"></a><span class="lineno">  562</span>&#160;          lb_medoidChange = <span class="keyword">true</span>;</div><div class="line"><a name="l00563"></a><span class="lineno">  563</span>&#160;        }</div><div class="line"><a name="l00564"></a><span class="lineno">  564</span>&#160;</div><div class="line"><a name="l00565"></a><span class="lineno">  565</span>&#160;      } <span class="comment">//For Cj</span></div><div class="line"><a name="l00566"></a><span class="lineno">  566</span>&#160;</div><div class="line"><a name="l00567"></a><span class="lineno">  567</span>&#160;  } <span class="keywordflow">while</span> (lb_medoidChange);</div><div class="line"><a name="l00568"></a><span class="lineno">  568</span>&#160;</div><div class="line"><a name="l00569"></a><span class="lineno">  569</span>&#160;<span class="preprocessor">#ifdef __VERBOSE_YES</span></div><div class="line"><a name="l00570"></a><span class="lineno">  570</span>&#160;  <span class="keywordflow">if</span> ( geiinparam_verbose &lt;= geiinparam_verboseMax ) {</div><div class="line"><a name="l00571"></a><span class="lineno">  571</span>&#160;    std::cout &lt;&lt; lpc_labelFunc</div><div class="line"><a name="l00572"></a><span class="lineno">  572</span>&#160;              &lt;&lt; <span class="stringliteral">&quot;: OUT(&quot;</span> &lt;&lt; geiinparam_verbose &lt;&lt; <span class="stringliteral">&quot;)\n&quot;</span>;</div><div class="line"><a name="l00573"></a><span class="lineno">  573</span>&#160;    std::ostringstream lostrstream_labelMedoids;</div><div class="line"><a name="l00574"></a><span class="lineno">  574</span>&#160;    lostrstream_labelMedoids &lt;&lt; <span class="stringliteral">&quot;&lt;MEDOIDS:&quot;</span></div><div class="line"><a name="l00575"></a><span class="lineno">  575</span>&#160;                             &lt;&lt; lpc_labelFunc;</div><div class="line"><a name="l00576"></a><span class="lineno">  576</span>&#160;    <a class="code" href="namespaceinout.html#a0c10a45877a347dec0d4ec4e5b05b828">inout::containerprint</a></div><div class="line"><a name="l00577"></a><span class="lineno">  577</span>&#160;      (aioarrayui_idxMedoids,</div><div class="line"><a name="l00578"></a><span class="lineno">  578</span>&#160;       aioarrayui_idxMedoids + (T_INSTANCEIDX)aicidx_numKMedoids,</div><div class="line"><a name="l00579"></a><span class="lineno">  579</span>&#160;       std::cout,</div><div class="line"><a name="l00580"></a><span class="lineno">  580</span>&#160;       lostrstream_labelMedoids.str().c_str(),</div><div class="line"><a name="l00581"></a><span class="lineno">  581</span>&#160;       <span class="charliteral">&#39;,&#39;</span></div><div class="line"><a name="l00582"></a><span class="lineno">  582</span>&#160;       ); </div><div class="line"><a name="l00583"></a><span class="lineno">  583</span>&#160;    std::cout &lt;&lt; <span class="charliteral">&#39;\n&#39;</span>;</div><div class="line"><a name="l00584"></a><span class="lineno">  584</span>&#160;    std::cout &lt;&lt;  <span class="stringliteral">&quot;lor_cost = &quot;</span> &lt;&lt; lor_cost;</div><div class="line"><a name="l00585"></a><span class="lineno">  585</span>&#160;    std::cout &lt;&lt; std::endl;</div><div class="line"><a name="l00586"></a><span class="lineno">  586</span>&#160;</div><div class="line"><a name="l00587"></a><span class="lineno">  587</span>&#160;    T_DIST lt_objetiveFunc = </div><div class="line"><a name="l00588"></a><span class="lineno">  588</span>&#160;      <a class="code" href="namespaceum.html#ad23c0567fb4c517ab9eaa0134af14bb5">um::SSEMedoid</a></div><div class="line"><a name="l00589"></a><span class="lineno">  589</span>&#160;      (aioarrayui_idxMedoids, </div><div class="line"><a name="l00590"></a><span class="lineno">  590</span>&#160;       aicidx_numKMedoids,</div><div class="line"><a name="l00591"></a><span class="lineno">  591</span>&#160;       aimattriag_dissimilarity</div><div class="line"><a name="l00592"></a><span class="lineno">  592</span>&#160;       );</div><div class="line"><a name="l00593"></a><span class="lineno">  593</span>&#160;    std::cout &lt;&lt; <span class="stringliteral">&quot;lt_objetiveFunc: &quot;</span> &lt;&lt; lt_objetiveFunc &lt;&lt; std::endl;</div><div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;</div><div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;  }</div><div class="line"><a name="l00596"></a><span class="lineno">  596</span>&#160;  --geiinparam_verbose;</div><div class="line"><a name="l00597"></a><span class="lineno">  597</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__VERBOSE_YES*/</span><span class="preprocessor"></span></div><div class="line"><a name="l00598"></a><span class="lineno">  598</span>&#160;</div><div class="line"><a name="l00599"></a><span class="lineno">  599</span>&#160;  <span class="keywordflow">return</span> lor_cost;</div><div class="line"><a name="l00600"></a><span class="lineno">  600</span>&#160;}</div><div class="line"><a name="l00601"></a><span class="lineno">  601</span>&#160;</div><div class="line"><a name="l00602"></a><span class="lineno">  602</span>&#160;} <span class="comment">/*END namespace medoids*/</span></div><div class="line"><a name="l00603"></a><span class="lineno">  603</span>&#160;</div><div class="line"><a name="l00604"></a><span class="lineno">  604</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/*__CLUSTERING_OPERATOR_MEDOIDS_HPP__*/</span><span class="preprocessor"></span></div><div class="ttc" id="namespaceclusteringop_html_a9811c142c169af0321631f773797089c"><div class="ttname"><a href="namespaceclusteringop.html#a9811c142c169af0321631f773797089c">clusteringop::nearestRepresentative</a></div><div class="ttdeci">std::tuple&lt; T_DIST, ds::PartitionLinked&lt; T_CLUSTERIDX &gt; &gt; nearestRepresentative(T_INSTANCEIDX *aioarrayui_idxMedoids, T_CLUSTERIDX aicidx_numKMedoids, const mat::MatrixTriang&lt; T_DIST &gt; &amp;aimattriag_dissimilarity)</div><div class="ttdoc">nearestRepresentative</div><div class="ttdef"><b>Definition:</b> <a href="clustering__operator__medoids_8hpp_source.html#l00047">clustering_operator_medoids.hpp:47</a></div></div>
<div class="ttc" id="classds_1_1_iterator_partition_linked_html"><div class="ttname"><a href="classds_1_1_iterator_partition_linked.html">ds::IteratorPartitionLinked</a></div><div class="ttdoc">An iterator for a PartitionLinked.</div><div class="ttdef"><b>Definition:</b> <a href="partition__linked_8hpp_source.html#l00035">partition_linked.hpp:35</a></div></div>
<div class="ttc" id="namespaceclusteringop_html"><div class="ttname"><a href="namespaceclusteringop.html">clusteringop</a></div><div class="ttdoc">Clustering operators.</div></div>
<div class="ttc" id="common_8hpp_html_af3832ec3c2aad9eb797abf385e290d28"><div class="ttname"><a href="common_8hpp.html#af3832ec3c2aad9eb797abf385e290d28">UINTIDX_NIL</a></div><div class="ttdeci">static const uintidx UINTIDX_NIL</div><div class="ttdef"><b>Definition:</b> <a href="common_8hpp_source.html#l00025">common.hpp:25</a></div></div>
<div class="ttc" id="classds_1_1_iterator_partition_linked_html_ad171cb96653fadaec272389381a4f8b4"><div class="ttname"><a href="classds_1_1_iterator_partition_linked.html#ad171cb96653fadaec272389381a4f8b4">ds::IteratorPartitionLinked::begin</a></div><div class="ttdeci">void begin(T_CLUSTERIDX aicidx_clusterK)</div><div class="ttdef"><b>Definition:</b> <a href="partition__linked_8hpp_source.html#l00372">partition_linked.hpp:372</a></div></div>
<div class="ttc" id="classds_1_1_partition_linked_html"><div class="ttname"><a href="classds_1_1_partition_linked.html">ds::PartitionLinked</a></div><div class="ttdoc">Data structure to define the instances that belong to a cluster consecutively.</div><div class="ttdef"><b>Definition:</b> <a href="partition__linked_8hpp_source.html#l00042">partition_linked.hpp:42</a></div></div>
<div class="ttc" id="namespaceum_html_ad23c0567fb4c517ab9eaa0134af14bb5"><div class="ttname"><a href="namespaceum.html#ad23c0567fb4c517ab9eaa0134af14bb5">um::SSEMedoid</a></div><div class="ttdeci">T_METRIC SSEMedoid(const uintidx *aiarrayidxinst_medoids, const T_CLUSTERIDX aicidx_numClustersK, const mat::MatrixTriang&lt; T_METRIC &gt; &amp;aimatrixtriagt_dissimilarity)</div><div class="ttdoc">SSEMedoid .</div><div class="ttdef"><b>Definition:</b> <a href="unsupervised__measures_8hpp_source.html#l04131">unsupervised_measures.hpp:4131</a></div></div>
<div class="ttc" id="classmat_1_1_bit_array_html"><div class="ttname"><a href="classmat_1_1_bit_array.html">mat::BitArray</a></div><div class="ttdoc">Bit array.</div><div class="ttdef"><b>Definition:</b> <a href="bit__array_8hpp_source.html#l00043">bit_array.hpp:43</a></div></div>
<div class="ttc" id="namespaceclusteringop_html_ac88386dee7f9622d967508e4111fa2e5"><div class="ttname"><a href="namespaceclusteringop.html#ac88386dee7f9622d967508e4111fa2e5">clusteringop::updateMedoids</a></div><div class="ttdeci">T_DIST updateMedoids(T_INSTANCEIDX *aioarrayui_idxMedoids, const T_CLUSTERIDX aicidx_numKMedoids, const T_INSTANCEIDX aiu_nearestNeighborsP, mat::MatrixTriang&lt; T_DIST &gt; &amp;aimattriag_dissimilarity)</div><div class="ttdoc">Update medoids, local search heuristic .</div><div class="ttdef"><b>Definition:</b> <a href="clustering__operator__medoids_8hpp_source.html#l00389">clustering_operator_medoids.hpp:389</a></div></div>
<div class="ttc" id="classds_1_1_iterator_partition_linked_html_a1a031c033d0d2d1c6982ced4e0473831"><div class="ttname"><a href="classds_1_1_iterator_partition_linked.html#a1a031c033d0d2d1c6982ced4e0473831">ds::IteratorPartitionLinked::getValue</a></div><div class="ttdeci">uintidx getValue()</div><div class="ttdef"><b>Definition:</b> <a href="partition__linked_8hpp_source.html#l00389">partition_linked.hpp:389</a></div></div>
<div class="ttc" id="namespaceinout_html_a0c10a45877a347dec0d4ec4e5b05b828"><div class="ttname"><a href="namespaceinout.html#a0c10a45877a347dec0d4ec4e5b05b828">inout::containerprint</a></div><div class="ttdeci">void containerprint(INPUT_ITERATOR iterator_first, INPUT_ITERATOR iterator_last, std::ostream &amp;os=std::cout, const char *aipc_label=&quot;&quot;, const char aic_delimCoef=',')</div><div class="ttdef"><b>Definition:</b> <a href="container__out_8hpp_source.html#l00050">container_out.hpp:50</a></div></div>
<div class="ttc" id="namespacenearest_html_a3c4239101cf18ab4ca62e654a4179995"><div class="ttname"><a href="namespacenearest.html#a3c4239101cf18ab4ca62e654a4179995">nearest::medoidsNN</a></div><div class="ttdeci">T_CLUSTERIDX medoidsNN(T_DIST_INSTANCESINSTANCES &amp;aort_distMinMedoidInst, const uintidx aiuidx_instance, const uintidx *aiarrayuidx_medoids, const T_CLUSTERIDX aicidx_numMedoisK, const mat::MatrixTriang&lt; T_DIST_INSTANCESINSTANCES &gt; &amp;aimatrixtriagt_dissimilarity)</div><div class="ttdef"><b>Definition:</b> <a href="nearestinstance__operator_8hpp_source.html#l00325">nearestinstance_operator.hpp:325</a></div></div>
<div class="ttc" id="dist__matrix__dissimilarity_8hpp_html"><div class="ttname"><a href="dist__matrix__dissimilarity_8hpp.html">dist_matrix_dissimilarity.hpp</a></div><div class="ttdoc">distance matrix between objects</div></div>
<div class="ttc" id="verbose__global_8hpp_html"><div class="ttname"><a href="verbose__global_8hpp.html">verbose_global.hpp</a></div><div class="ttdoc">verbose global</div></div>
<div class="ttc" id="instance_8hpp_html"><div class="ttname"><a href="instance_8hpp.html">instance.hpp</a></div><div class="ttdoc">Module for the handling of instances or also called objects or points.</div></div>
<div class="ttc" id="namespaceclusteringop_html_a2543f9db12028d26cf5eb603370baa52"><div class="ttname"><a href="namespaceclusteringop.html#a2543f9db12028d26cf5eb603370baa52">clusteringop::computeCostInstanceClusterJ</a></div><div class="ttdeci">T_DIST computeCostInstanceClusterJ(T_INSTANCEIDX aiuintidx_medoids, T_CLUSTERIDX aicidx_Cj, ds::PartitionLinked&lt; T_CLUSTERIDX &gt; &amp;aipartlink_partition, mat::MatrixTriang&lt; T_DIST &gt; &amp;aimattriag_dissimilarity)</div><div class="ttdoc">computeCostInstanceClusterJ</div><div class="ttdef"><b>Definition:</b> <a href="clustering__operator__medoids_8hpp_source.html#l00319">clustering_operator_medoids.hpp:319</a></div></div>
<div class="ttc" id="classmat_1_1_matrix_triang_html_ae8e385b7959c85519692bdee1d4c3aed"><div class="ttname"><a href="classmat_1_1_matrix_triang.html#ae8e385b7959c85519692bdee1d4c3aed">mat::MatrixTriang::getNumRows</a></div><div class="ttdeci">const uintidx getNumRows() const</div><div class="ttdef"><b>Definition:</b> <a href="matrix__triangular_8hpp_source.html#l00128">matrix_triangular.hpp:128</a></div></div>
<div class="ttc" id="classds_1_1_iterator_partition_linked_html_af0e179fae69c0d4f047082ee44783613"><div class="ttname"><a href="classds_1_1_iterator_partition_linked.html#af0e179fae69c0d4f047082ee44783613">ds::IteratorPartitionLinked::end</a></div><div class="ttdeci">bool end()</div><div class="ttdef"><b>Definition:</b> <a href="partition__linked_8hpp_source.html#l00384">partition_linked.hpp:384</a></div></div>
<div class="ttc" id="classmat_1_1_matrix_triang_html"><div class="ttname"><a href="classmat_1_1_matrix_triang.html">mat::MatrixTriang&lt; T_DIST &gt;</a></div></div>
<div class="ttc" id="classds_1_1_iterator_partition_linked_html_a83b887be41c97dc0bdfc47a02abbc383"><div class="ttname"><a href="classds_1_1_iterator_partition_linked.html#a83b887be41c97dc0bdfc47a02abbc383">ds::IteratorPartitionLinked::next</a></div><div class="ttdeci">void next()</div><div class="ttdef"><b>Definition:</b> <a href="partition__linked_8hpp_source.html#l00378">partition_linked.hpp:378</a></div></div>
<div class="ttc" id="namespaceclusteringop_html_afe5f3dd79bf850625b0e330cd42873b3"><div class="ttname"><a href="namespaceclusteringop.html#afe5f3dd79bf850625b0e330cd42873b3">clusteringop::computeTotalCostSwap</a></div><div class="ttdeci">T_DIST computeTotalCostSwap(const T_INSTANCEIDX aiuiidx_medoidRand, const T_CLUSTERIDX *aiarraycidx_memberShip, T_INSTANCEIDX *aoarrayuiidx_medoids, const T_CLUSTERIDX aicidx_numKMedoids, const mat::MatrixTriang&lt; T_DIST &gt; &amp;aimattriag_dissimilarity)</div><div class="ttdoc">computeTotalCostSwap</div><div class="ttdef"><b>Definition:</b> <a href="clustering__operator__medoids_8hpp_source.html#l00221">clustering_operator_medoids.hpp:221</a></div></div>
<div class="ttc" id="partition__linked_8hpp_html"><div class="ttname"><a href="partition__linked_8hpp.html">partition_linked.hpp</a></div><div class="ttdoc">Linked partition data structure.</div></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Fri Apr 19 2019 08:58:31 for Library Evolutionary Algorithms for Clustering (LEAC) by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.15
</small></address>
</body>
</html>
